منابع مشابه
Holomorphic Invariance of Stein Neighborhood Bases
Let Ω be a smooth bounded pseudoconvex domain in Cn. We give several characterizations for the closure of Ω to have a Stein neighborhood basis in the sense that Ω has a defining function ρ such that {z ∈ Cn : ρ(z) < ε} is pseudoconvex for sufficiently small ε > 0. We also show that this condition is invariant under proper holomorphic maps that extend smoothly to the boundary.
متن کاملFinding strong pseudoprimes to several bases II
Define ψm to be the smallest strong pseudoprime to all the first m prime bases. If we know the exact value of ψm, we will have, for integers n < ψm, a deterministic efficient primality testing algorithm which is easy to implement. Thanks to Pomerance et al. and Jaeschke, the ψm are known for 1 ≤ m ≤ 8. Upper bounds for ψ9, ψ10 and ψ11 were first given by Jaeschke, and those for ψ10 and ψ11 were...
متن کاملFinding strong pseudoprimes to several bases
Define ψm to be the smallest strong pseudoprime to all the first m prime bases. If we know the exact value of ψm, we will have, for integers n < ψm, a deterministic primality testing algorithm which is not only easier to implement but also faster than either the Jacobi sum test or the elliptic curve test. Thanks to Pomerance et al. and Jaeschke, ψm are known for 1 ≤ m ≤ 8. Upper bounds for ψ9, ...
متن کاملRevisiting strong Gröbner bases over Euclidean domains
Buchberger and Kandri−Rody and Kapur defined a strong Gröbner basis for a polynomial ideal over a Euclidean domain in a way that gives rise to canonical reductions. This retains what is perhaps the most important property of Gröbner bases over fields. A difficulty is that these can be substantially harder to compute than their field counterparts. We extend their results for computing these base...
متن کاملStrong Pseudoprimes to Twelve Prime Bases
Let ψm be the smallest strong pseudoprime to the first m prime bases. This value is known for 1 ≤ m ≤ 11. We extend this by finding ψ12 and ψ13. We also present an algorithm to find all integers n ≤ B that are strong pseudoprimes to the first m prime bases; with a reasonable heuristic assumption we can show that it takes at most B2/3+o(1) time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complex Variables and Elliptic Equations
سال: 2012
ISSN: 1747-6933,1747-6941
DOI: 10.1080/17476933.2010.534785